A gradient based resolution strategy for a PDE-constrained optimization approach for 3D-1D coupled problems

نویسندگان

چکیده

Coupled 3D-1D problems arise in many practical applications, an attempt to reduce the computational burden simulations where cylindrical inclusions with a small section are embedded much larger domain. Nonetheless resolution of such can be non trivial, both from mathematical and geometrical standpoint. Indeed coupling requires operate standard function spaces, and, also, simulation geometries complex for presence multiple intersecting domains. Recently, PDE-constrained optimization based formulation has been proposed problems, proving well posed allowing use conforming meshes discrete problem. Here unconstrained problem is derived efficient gradient solver formulation, along suitable preconditioner speed up iterative solver. Some numerical tests on quite configurations discussed show viability method .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a new approach to credibility premium for zero-inflated poisson models for panel data

هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...

15 صفحه اول

Constrained Programming for Optimization Problems in PDE

Optimization problems in PDE models are often approached by considering the PDE model as a black-box input-output relation and thus solving an unconstrained optimization problem. In contrast to that, considering the PDE model as a side condition of a resulting constrained programming problem enables us to simultaneously solve the PDE model equations together with the optimization problem. This ...

متن کامل

A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems

In this paper‎, ‎two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS})‎ ‎conjugate gradient method are presented to solve unconstrained optimization problems‎. ‎A remarkable property of the proposed methods is that the search direction always satisfies‎ ‎the sufficient descent condition independent of line search method‎, ‎based on eigenvalue analysis‎. ‎The globa...

متن کامل

Image Restoration Using A PDE-Based Approach

 Image restoration is an essential preprocessing step for many image analysis applications. In any image restoration techniques, keeping structure of the image unchanged is very important. Such structure in an image often corresponds to the region discontinuities and edges. The techniques based on partial differential equations, such as the heat equations, are receiving considerable attention i...

متن کامل

A Newton-picard Approach for Efficient Numerical Solution of Time-periodic Parabolic Pde Constrained Optimization Problems

We investigate an iterative method for the solution of time-periodic parabolic PDE constrained optimization problems. It is an inexact Sequential Quadratic Programming (iSQP) method based on the Newton-Picard approach. We present and analyze a linear quadratic model problem and prove optimal mesh-independent convergence rates. Additionally, we propose a two-grid variant of the Newton-Picard met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Gem - International Journal on Geomathematics

سال: 2021

ISSN: ['1869-2680', '1869-2672']

DOI: https://doi.org/10.1007/s13137-021-00192-0